package Tree;

import java.util.ArrayList;
import java.util.List;

public class Leet_94 {
}

class Solution_94 {

    List<Integer> result = new ArrayList<>();
    public List<Integer> inorderTraversal(TreeNode root) {
        inorder(root);
        return result;
    }

    public void inorder(TreeNode root){
        if(root==null){return;}

        inorderTraversal(root.left);
        result.add(root.val);
        inorderTraversal(root.right);
    }

}
